System and method for intelligent update flow across inter and intra update dependencies

ABSTRACT

A method for managing updates of a data manager includes: obtaining a service call graph where the service call graph includes services grouped into service sub-trees and specifies a service hierarchy between the services; identifying the service sub-trees of the service call graph; identifying, using the service hierarchy, independent services among the services of the service call graph; generating, based on identifying the service sub-trees and the independent services, an update sequence for the services; predicting, using the update sequence and the services, an update window for the service sub-trees; and initiating an update of the services using the prediction of the update window.

BACKGROUND

Computing devices may provide services. To provide the services, the computing devices may include hardware components and software components. The software components may be updated to improve the performance of the aforementioned services. The performance of the services may be important to users and/or other computing devices.

SUMMARY

In general, in one aspect, the invention relates to a method for managing updates of a data manager. The method comprises: obtaining a service call graph, wherein the service call graph comprises services grouped into service sub-trees and specifies a service hierarchy between the services; identifying the service sub-trees of the service call graph; identifying, using the service hierarchy, independent services among the services of the service call graph; generating, based on identifying the service sub-trees and the independent services, an update sequence for the services; predicting, using the update sequence and the services, an update window for the service sub-trees; and initiating an update of the services using the prediction of the update window.

In general, in one aspect, the invention relates to a system that includes a data manager and a distributed control manager of the data manager. The distributed control manager is configured to: obtain a service call graph, wherein the service call graph comprises services grouped into service sub-trees and specifies a service hierarchy between the services; identify the service sub-trees of the service call graph; identify, using the service hierarchy, independent services among the services of the service call graph; generate, based on identifying the service sub-trees and the independent services, an update sequence for the services; predict, using the update sequence and the services, an update window for the service sub-trees; and initiate an update of the services using the prediction of the update window.

In general, in one aspect, the invention relates to a non-transitory computer readable medium which includes computer readable program code, which when executed by a computer processor enables the computer processor to perform a method for managing updates of a data manager. The method comprises: obtaining a service call graph, wherein the service call graph comprises services grouped into service sub-trees and specifies a service hierarchy between the services; identifying the service sub-trees of the service call graph; identifying, using the service hierarchy, independent services among the services of the service call graph; generating, based on identifying the service sub-trees and the independent services, an update sequence for the services; predicting, using the update sequence and the services, an update window for the service sub-trees; and initiating an update of the services using the prediction of the update window.

BRIEF DESCRIPTION OF DRAWINGS

Certain embodiments of the invention will be described with reference to the accompanying drawings. However, the accompanying drawings illustrate only certain aspects or implementations of the invention by way of example and are not meant to limit the scope of the claims.

FIG. 1A shows a diagram of a system in accordance with one or more embodiments of the invention.

FIG. 1B shows a diagram of a storage in accordance with one or more embodiments of the invention.

FIG. 2 shows a diagram of a service metadata repository in accordance with one or more embodiments of the invention.

FIG. 3A shows a flowchart of a method for managing service change events in accordance with one or more embodiments of the invention.

FIGS. 3B-3C show flowcharts of a method for managing updates of a data manager in accordance with one or more embodiments of the invention.

FIG. 3D shows a flowchart of a method for predicting an update window in accordance with one or more embodiments of the invention.

FIGS. 4A-4E show diagrams of the operation of an example system over time in accordance with one or more embodiments of the invention.

FIGS. 5A-5D show an implementation example in accordance with one or more embodiments of the invention.

FIG. 6 shows a diagram of a computing device in accordance with one or more embodiments of the invention.

DETAILED DESCRIPTION

Specific embodiments will now be described with reference to the accompanying figures. In the following description, numerous details are set forth as examples of the invention. It will be understood by those skilled in the art that one or more embodiments of the present invention may be practiced without these specific details and that numerous variations or modifications may be possible without departing from the scope of the invention. Certain details known to those of ordinary skill in the art are omitted to avoid obscuring the description.

In the following description of the figures, any component described with regard to a figure, in various embodiments of the invention, may be equivalent to one or more like-named components described with regard to any other figure. For brevity, descriptions of these components will not be repeated with regard to each figure. Thus, each and every embodiment of the components of each figure is incorporated by reference and assumed to be optionally present within every other figure having one or more like-named components. Additionally, in accordance with various embodiments of the invention, any description of the components of a figure is to be interpreted as an optional embodiment, which may be implemented in addition to, in conjunction with, or in place of the embodiments described with regard to a corresponding like-named component in any other figure.

Throughout this application, elements of figures may be labeled as A to N. As used herein, the aforementioned labeling means that the element may include any number of items and does not require that the element include the same number of elements as any other item labeled as A to N. For example, a data structure may include a first element labeled as A and a second element labeled as N. This labeling convention means that the data structure may include any number of the elements. A second data structure, also labeled as A to N, may also include any number of elements. The number of elements of the first data structure and the number of elements of the second data structure may be the same or different.

In general, embodiments of the invention relate to a system and method for managing the update of a data manager that includes services. More specifically, embodiments of the invention relate to identifying a service sub-tree that includes a uniquely dependent portion of the services, predicting an update window to perform the update of the services in the service sub-tree, and applying the update to the services of the service sub-tree. Further, the update may be applied based on an update sequence which may specify an order of service sub-trees and services to update. A service may include at least one active service instance and at least one standby service instance. A service may be updated by updating the standby service instance, switching the updated standby service instance to an updated active service instance, and switching the previously active service instance to a standby service instance. As a result, the updated active service instance may begin to service requests.

Additionally, embodiments of the invention may determine a shortest duration necessary for updating all of the services in the service call graph while also preventing updates of one service from disrupting updates of other services. In particular, services within the service call graph that can be updated in parallel without affecting the update process of services that depend from these services are identified. As a result, a total update completion time for an entirety of the service call graph may be advantageously reduced.

A performance and reliability check may be performed on the updated active service instance to ensure that the performance of the updated active service instance is satisfactory. The previously active standby service instance may be updated if the performance of the updated active service instance is satisfactory. The update to the updated active service instance may be reversed, the previously active standby instance may be switched to an active instance, and the previously updated active instance may be switched to a standby instance if the performance of the updated active service instance is not satisfactory. As a result, the data manager may be updated in a manner that minimizes downtime of services thereby reducing the impact of updates to data manager performance.

FIG. 1A shows a diagram of a system in accordance with one or more embodiments of the invention. The system may include a data manager (100) and clients (130). The system may include other and/or additional components without departing from the invention.

In one or more embodiments of the invention, the data manager (100) includes the functionality to perform management services for the clients (130). As a result, the clients (130) may send requests to the data manager to perform the management services. The requests may include requests to read data, requests to write data, requests to fetch data, requests to modify data, requests to move data, requests to delete data, and/or other and/or additional types of requests without departing from the invention. The data manager (100) may include other and/or additional functionalities without departing from the invention.

In one or more embodiments of the invention, the data manager (100) is implemented as a computing device (see e.g., FIG. 5 ). The computing device may be, for example, a mobile phone, a tablet computer, a laptop computer, a desktop computer, a server, a distributed computing system, or a cloud resource. The computing device may include one or more processors, memory (e.g., random access memory), and persistent storage (e.g., disk drives, solid state drives, etc.). The computing device may include instructions, stored on the persistent storage, that when executed by the processor(s) of the computing device cause the computing device to perform the functionality of the data manager (100) described throughout this application.

In one or more embodiments of the invention, the data manager (100) is implemented as a logical device. The logical device may utilize the computing resources of any number of computing devices and thereby provide the functionality of the data manager (100) described throughout this application.

As discussed above, the management services performed by the data manager may include servicing requests. The management services of the data manager may be separated into each individual service of the management services. The services (110) of the management services may include, for example, discovery services, inventory services, monitoring services, and other and/or additional types of management services without departing from the invention. A service may perform all and/or a portion of a request. The requests may be external requests (e.g., requests obtained from clients (130)) and/or internal requests (e.g., requests obtained from one service of the data manager (100) and serviced by another service of the data manager (100)). Each service may include at least one active instance and at least one standby instance. Accordingly, service A (110A) may include a service A active instance(s) (112A) and a service A standby instance(s) (114A), and service N (110N) may include a service N active instance(s) (112N) and a service N standby instance(s) (114N). The active instances may perform the requests directed at the associated service while the standby request may not perform the request directed at the associated service. The services (110) may be implemented as computer instructions, e.g., computer code, stored on a storage (e.g., 120) that when executed by a processor(s) of the data manager (100) cause the data manager (100) to provide the functionality of the services (110) described throughout this application. The data manager (100) may be updated and, as a result, each service may be updated.

The data manager (100) may include a discovery manager (102). The discovery manager (102) may include the functionality to manage service change events as discussed in FIG. 3A. As a result of the aforementioned functionality, the discovery manager (102) may generate, update, and/or maintain a service routing table (discussed below). The discovery manager (102) may include other and/or additional functionalities without departing from the invention.

In one or more embodiments of the invention, the discovery manager (102) is a physical device. The physical device may include circuitry. The physical device may be, for example, a field-programmable gate array, application specific integrated circuit, programmable processor, microcontroller, digital signal processor, or other hardware processor. The physical device may be adapted to provide the functionality of the discovery manager (102) described throughout this application.

In one or more embodiments of the invention, the discovery manager (102) is implemented as computer instructions, e.g., computer code, stored on a persistent storage that when executed by a processor of the data manager (100) causes the data manager (100) to provide the functionality of the discovery manager (102) described throughout this application.

The data manager (100) may include a distributed control manager (104). The distributed control manager (104) may include the functionality to manage updates of the data manager (100) as discussed in FIGS. 3B-3D. The distributed control manager (104) may include other and/or additional functionalities without departing from the invention.

In one or more embodiments of the invention, the distributed control manager (104) is a physical device. The physical device may include circuitry. The physical device may be, for example, a field-programmable gate array, application specific integrated circuit, programmable processor, microcontroller, digital signal processor, or other hardware processor. The physical device may be adapted to provide the functionality of the distributed control manager (104) described throughout this application.

In one or more embodiments of the invention, the distributed control manager (104) is implemented as computer instructions, e.g., computer code, stored on a persistent storage that when executed by a processor of the data manager (100) causes the data manager (100) to provide the functionality of the distributed control manager (104) described throughout this application.

In one or more embodiments of the invention, the clients (130) utilize management services provided by the data manager (100). The clients (130) may include any number of clients such as client A (130A) and client N (130N).

In one or more embodiments of the invention, a client of the clients (130) is implemented as a computing device (see e.g., FIG. 5 ). The computing device may be, for example, a mobile phone, a tablet computer, a laptop computer, a desktop computer, a server, a distributed computing system, or a cloud resource. The computing device may include one or more processors, memory (e.g., random access memory), and persistent storage (e.g., disk drives, solid state drives, etc.). The computing device may include instructions, stored on the persistent storage, that when executed by the processor(s) of the computing device cause the computing device to perform the functionality of the clients (130) described throughout this application.

In one or more embodiments of the invention, the clients (130) are implemented as a logical device. The logical device may utilize the computing resources of any number of computing devices and thereby provide the functionality of the clients (130) described throughout this application.

FIG. 1B shows a diagram of a storage in accordance with one or more embodiments of the invention. The storage may be an embodiment of the storage (120, FIG. 1A) discussed above. As discussed above, the storage (120) may store data and metadata that may be used by the distributed control manager (104, FIG. 1A) to perform updates of the services of the data manager (100, FIG. 1A) and by the services (110) of the data manager (100) to perform requests. The storage (120) include a service metadata repository (122), a requests and performance metrics information repository (124), and a services shared data volumes repository (126). The storage (120) may include other and/or additional data and/or metadata without departing from the invention. Each of the aforementioned components of the storage (120) is discussed below.

In one or more embodiments of the invention, the service metadata repository includes information associated with services and may be used by the distributed control manager (104, FIG. 1A) to perform updates of the services of the data manager (100, FIG. 1A) and by the services (110) of the data manager (100) to perform requests. For additional information regarding the service metadata repository (122), refer to FIG. 2 .

The requests and performance metrics information repository (124) may include one or more data structures that include requests and performance metrics information associated with each service of the services (110) of the data manager (100, FIG. 1A). The requests and performance metrics information may include time series data (i.e., when a request was initiated and when it was completed) associated with each request performed by the services of the data manager and each service instance of the services of the data manager (100, FIG. 1A). The time series data may be generated using monitoring information associated with each request and each service instance obtained from the distributed control manager (104, FIG. 1A) and/or clients (130, FIG. 1A). The time series data may be used to determine the response completion times and service throughout for each request. Additionally, the time series data may be used to predict an update window for a service sub-tree. Additionally, the requests and performance metrics information may include performance metrics associated with each service. The performance metrics may include, for example, central processing unit (CPU) utilization, memory utilization, and IO performance information associated with the performance of requests. The performance metrics may be used in combination with the time series data to maintain a historical record of the performances of requests by the services. This historical record may be used in comparison with the requests and performance metrics information associated with the performance of post-update requests to perform performance and reliability checks on updated service instances to determine whether updated service instances are optimally performing requests. The requests and performance metrics information repository (124) may include other and/or additional information without departing from the invention.

The services shared data volumes repository (126) may include one or more data structures that include data used by and/or associated with each service. Each service may be associated with a portion of the services shared data volumes repository (126). Each service, including all its instances, may store the data associated with the service in the portion of the services shared data volumes repository (126), which is provisioned for each service. The shared volume per service may provide data isolation among various services, making each service self-contained. The data associated with each service may be used to restore updated service instances to previous versions. The services shared data volumes repository (126) may include other and/or additional data and may be used by other and/or additional purposes without departing from the invention.

FIG. 2 shows a diagram of a service metadata repository in accordance with one or more embodiments of the invention. The service metadata repository may be an embodiment of the service metadata repository (122, FIG. 1B) discussed above. As discussed above, the service metadata repository (122) may include information associated with services and may be used by the distributed control manager (104, FIG. 1A) to perform updates of the services of the data manager (100, FIG. 1A) and by the services (110) of the data manager (100) to perform requests. The service metadata repository (122) may be generated and maintained by the discovery manager (102, FIG. 1A) and the distributed control manager (104, FIG. 1A). The service metadata repository (122) may include a service routing table (200), a service dependency matrix (202), a service compatibility matrix (204), and a service call graph (206). The service metadata repository may include other and/or additional information without departing from the invention. Each of the aforementioned components of the service metadata repository (122) is discussed below.

The service routing table (200) may be one or more data structures that includes service information associated with each service (e.g., 110A, FIG. 1A) of the data manager (100, FIG. 1A). The service information may include a service identifier, service version, host identifier associated with the service, an endpoint uniform resource locator (URL) address and/or a port number associated with service instances of the services, a status that depicts whether the service is currently running, instance identifiers, and activity flags that denote whether instances are active instances or standby instances. The service information may include other and/or additional information without departing from the invention. The service routing table (200) may be maintained by the discovery manager (102, FIG. 1A) during a service change event and by the distributed control manager (104, FIG. 1A) during an update of the data manager (100, FIG. 1A). The service routing table (200) may be used by services (110, FIG. 1A) and/or clients (130, FIG. 1A) to perform requests. The service routing table (200) may include other and/or additional types of information and may be used for other and/or additional purposes without departing from the invention.

The service dependency matrix (202) may be one or more data structures that include service dependency information. The service dependency information may specify, for each service, which other services that service is dependent upon to perform requests. The service dependency information may relate service identifiers to denote the service dependencies. The service dependency information may include other and/or additional information without departing from the invention. The service dependency matrix (202) may be used to generate the service call graph (206). The service dependency matrix (202) may be generated using manufacture's recommendation of dependencies and/or using requests and performance metrics information included in the requests and performance metrics information repository (124) (discussed above). The service dependency matrix (202) may include other and/or additional types of information without departing from the invention.

The service compatibility matrix (204) may be one or more data structures that include service compatibility information. The service compatibility information may include service identifiers and service versions for each service. The service compatibility information may also specify the versions of services within which each service is compatible. In other words, the service compatibility information specifies which versions of the dependent services a particular service may use to perform requests. The service compatibility information may be generated using manufacture's recommendation of compatibilities and/or using requests and performance metrics information included in the requests and performance metrics information repository (124) (discussed above). The service compatibility information may include other and/or additional information without departing from the invention. The service compatibility matrix (204) may include other and/or additional types of information without departing from the invention.

The service call graph (206) may be one or more data structures that include service hierarchical information (herein also referred to as “a service hierarchy of the service call graph”). The service hierarchical information may specify a hierarchical relationship of dependencies between the services of the data manager (100, FIG. 1A). The service hierarchical information may include service identifiers. The service call graph (206) may be used to identify service sub-trees. Service sub-trees may be a unique portion of dependent services in the services call graph (206) that do not share services with other service sub-trees. The service hierarchical information may include other and/or additional information without departing from the invention. The service call graph (206) may include other and/or additional types of information without departing from the invention.

FIG. 3A shows a flowchart of a method for managing service change events in accordance with one or more embodiments of the invention. The method may be performed by, for example, a discovery manager (102) of a data manager (100). Other components of the system illustrated in FIG. 1A may perform all, or a portion, of the method of FIG. 3A without departing from the invention.

While FIG. 3A is illustrated as a series of steps, any of the steps may be omitted, performed in a different order, additional steps may be included, and/or any or all of the steps may be performed in a parallel and/or partially overlapping manner without departing from the invention.

In step 300, a service change event is identified.

In one or more embodiments of the invention, the service change event is identified by obtaining a message from a service instance. The message may include a request to register with the discovery manager. The message may include a service instance identifier and information that may be used to communicate (i.e., URL address and/or port number) with the service instance. The message may include other and/or additional information without departing from the invention. The service change event may be identified via other and/or additional methods without departing from the invention.

In one or more embodiments of the invention, the discovery manager periodically sends messages to the registered service instances. In response to obtaining the periodic message, a service instance may respond to the discovery manager with an affirmation message that indicates that the service instance has not failed, been corrupted, and/or otherwise removed from the data manager. The discovery manager may wait for a predetermined amount of time for a response from a service instance. When the predetermined amount of time has expired following a periodic message, the discovery manager may identify the failure of a service instance to respond within the predetermined amount of time as the service change event. The predetermined amount of time may be any amount of time without departing from the invention. The service change event may be identified via other and/or additional methods without departing from the invention.

In one or more embodiments of the invention, registered service instances send regular messages to the discovery manager. The regular messages may affirm that the service instances have not failed, been corrupted, and/or otherwise removed from the data manager. The discovery manager may monitor the time between receiving the messages associated with each service instance. The discovery manager may wait a predetermined amount of time between each regular message. When the predetermined amount of time has expired since obtaining the last regular message associated with a service instance, the discovery manager may identify the failure of a service instance to send the regular message within the predetermined amount of time as the service change event. The predetermined amount of time may be any amount of time without departing from the invention. The service change event may be identified via other and/or additional methods without departing from the invention.

In step 302, a determination is made as to whether the service change event is associated with a new service.

In one or more embodiments of the invention, the discovery manager determines whether the service change event is associated with a new service by either identifying whether the service change event is associated with a service instance registration request or a predetermined amount of time has expired before obtaining a response from a service instance. If the discovery manager identifies the service change event as a message that includes a request to register a service instance (i.e., not an expiration of a predetermined amount of time), then the discovery manager may determine that the service change event is associated with a new service. If the discovery manager identifies that the service change event is associated with a predetermined amount of time expiring (i.e., not a registration request), then the discovery manager may determine that the service change event is not associated with a new service. It may be determined whether the service change event is associated with a new service via other and/or additional methods without departing from the invention.

In one or more embodiments of the invention, if it is determined that the service change event is associated with a new service, then the method proceeds to step 304. In one or more embodiments of the invention, if it is determined that the service change event not associated with a new service, then the method proceeds to step 308.

In step 304, the service metadata associated with the new service from the service change event is obtained.

In one or more embodiments of the invention, the discovery manager sends a message to the service instance using the information included in the registration request. The message may include a request for service metadata associated with the service instance. In response to obtaining the message, the service instance may provide the service metadata to the discovery manager. The service metadata associated with the new service from the service change event may be obtained via other and/or additional methods without departing from the invention.

In step 306, the service routing table is updated to include an entry associated with the new service.

In one or more embodiments of the invention, the discovery manager updates the service routing table by generating an entry associated with the service instance. The entry may include the information associated with the service instance included in the registration request and the service metadata associated with the service instance. The discovery manager may specify the service type associated with the service instance and the service instance identifier associated with the active or standby instance of the service instance in the service routing table entry that is associated with the service instance using the service metadata obtained from the service. The entry in the service routing table may include other and/or additional information without departing from the invention. The service routing table may be updated to include an entry associated with the new service via other and/or additional means without departing from the invention.

In one or more embodiments of the invention, the method ends following step 306.

In step 308, the service is removed from the service routing table.

In one or more embodiments of the invention, the discovery manager updates the service routing table to remove the service instance from the service routing table. Removing the service instance from the service routing table may indicate that the service instance is no longer executing on the data manager, and as a result, may not be updated and may not be used to perform requests for other services and/or clients. The service may be removed from the service routing table via other and/or additional methods without departing from the invention.

In one or more embodiments of the invention, the method ends following step 308.

FIGS. 3B-3C show flowcharts of a method for managing updates of a data manager in accordance with one or more embodiments of the invention. The method may be performed by, for example, a distributed control manager (104) of a data manager (100). Other components of the system illustrated in FIG. 1A may perform all, or a portion, of the method of FIGS. 3B-3C without departing from the invention.

While FIGS. 3B-3C are illustrated as a series of steps, any of the steps may be omitted, performed in a different order, additional steps may be included, and/or any or all of the steps may be performed in a parallel and/or partially overlapping manner without departing from the invention.

In step 310, a service update event is identified.

In one or more embodiments of the invention, a user of the data manager or an entity that manages updates of the data manager (not shown) sends a message to the distributed control manager. The message may include a request to perform an update. The update may be associated with any number of services executing on the data manager. The message may specify the services associated with the update (i.e., include service identifiers associated with services to be updated). The message may include the updates to the services. The updates may include computer instructions, that when executed by the data manager, result in the instantiation of an updated service. The message may include other and/or additional information and/or data without departing from the invention. The distributed control manager may identify obtaining the message as the service update event. The service update event may be identified via other and/or additional methods without departing from the invention.

In step 312, service sub-trees are identified based on a service call graph and a rank is specified for each of the identified service sub-trees and for each of the services of the service call graph.

In one or more embodiments of the invention, the distributed control manager uses the service call graph to identify service sub-trees that include the services to be updated based on the service update event. As discussed above, the service call graph specifies the hierarchical relationship of the dependencies (i.e., specifies a service hierarchy) of the services executing on the data manager. The distributed control manager may identify the services associated with the update request included in the service call graph. The distributed control manager may then identify service sub-trees using the service call graph and the identified service. The distributed control graph may identify a portion of the identified services that are uniquely dependent on or depended on by only other services in the portion of the identified services as a service sub-tree. In other words, the services in a service sub-tree may share a unique dependency not found in other service sub-trees. The distributed control manager may identify any number of service sub-trees without departing from the invention. The service sub-trees may be located at any portion of the service call graph without departing from the invention. Service sub-trees may be identified based on the service call graph via other and/or additional methods without departing from the invention.

Furthermore, in one or more embodiments, each of the services and each of the identified service sub-trees are ranked based on their respective positions on the service call graph. In particular, each level of the service hierarchy is assigned a rank. Each service at a specified level of the service hierarchy is assigned the rank assigned to that level. Each service sub-tree is then assigned a rank based on the services included in the service sub-tree. The ranks of the services and the service sub-trees are used to determine an update sequence of the services. For example, a service that all other services depend from (i.e., a service that does not depend on updates of other services) may be ranked highest within the service hierarchy. The highest rank indicates that this service will be the first to be updated because its update does not depend on updates of other services. A non-limiting example showing details of a service sub-tree identification process and a services and service sub-trees ranking process is discussed below in FIGS. 5A-5D.

In step 313, independent services among the services of the service call graph are identified.

In one or more embodiments of the invention the distributed control manager identifies one or more services that can be updated in parallel without affecting an update process of services that depend from these services. These services that can be updated in parallel are referred to as independent services of the service call graph. The distributed control manager identifies the independent services by first identifying at least two services that have a same rank within the service hierarchy. The distributed control manager then determines whether the at least two services share a common immediate parent (i.e., whether a service within the service call graph directly depends from both of the at least two services) on the service call graph. In the event the at least two services do not share a common parent on the service call graph, the at least two services are identified as independent services that can be updated in parallel with one another without affecting the other services that depend from these services. A non-limiting example showing details of an independent services identification process is discussed below in FIGS. 5A-5D.

In step 314, an update sequence for the service sub-trees is generated.

In one or more embodiments of the invention, the distributed control manager identifies the update sequence for the service sub-tress based on each service sub-tree's position in the service call graph. The distributed control manager may assign each service subtree a position in the update sequence based on the position of each service sub-tree in the service call graph (i.e., based on the rank of each service sub-tree). The update sequence may specify an order of service sub-trees and services included in the service sub-trees to update. The update sequence may include an ordered list of service sub-tree identifiers and an ordered list of service identifiers. The distributed control manager may assign service sub-trees located at a lower portion of the service call graph higher in the update sequence than service sub-trees located at a higher portion of the service call graph. In other words, a service sub-tree positioned at the lowest part of the service call graph may be assigned a higher update sequence position and be updated prior to a service sub-tree at a higher part of the service call graph. Each service of a service sub-tree may be updated sequentially from the top service of the service sub-tree to the bottom services of the service sub-tree based on the service call graph. Additionally, each set of independent services have the same rank may be updated in parallel within the update sequence. The update sequence for the service sub-trees may be generated using other and/or additional methods without departing from the invention. A non-limiting example showing details of an update sequence generation process is discussed below in FIGS. 5A-5D.

In step 316, the update window for each service sub-tree is predicted. In one or more embodiments of the invention, the distributed control manager uses the requests and performance metrics information repository to predict the update window for each service sub-tree. An update window is a period of time in which the number of and/or requirements for requests submitted to the services of a service sub-tree are negligible and is therefore optimal for performing updates. For additional information regarding predicting the update window for a service sub tree, refer to FIG. 3D.

In step 318, a service sub-tree is selected.

In one or more embodiments of the invention, the distributed control manager selects the highest positioned service subtree in the update sequence that has not been previously selected. As discussed above, the update sequence specifies an order for applying updates to the service sub-trees and the services included in the service sub-trees associated with the service update event. After selecting a service sub-tree, the distributed control manager may tag the update sequence and/or remove the service sub-tree identifier included in the update sequence to indicate that the service sub-tree has been selected so as to not select a previously selected service sub-tree. A service sub-tree may be selected via other and/or additional methods without departing from the invention.

In step 320, a service of the service sub-tree is selected.

In one or more embodiments of the invention, the distributed control manager selects the highest positioned service in the service sub-tree that has not been previously selected. After selecting a service of the service sub-tree, the distributed control manager may tag the service sub-tree and/or remove the service identifier included in the service sub-tree to indicate that the service has been selected so as to not select a previously selected service. A service may be selected via other and/or additional methods without departing from the invention.

In step 322, a backup of a portion of the services shared data volume repository associated with the service is generated.

In one or more embodiments of the invention, the distributed control manager generates a backup of the data associated with the service in the services shared data volume repository. The distributed control manager may use any backup generation techniques without departing from the invention. The distributed control manager may generate two backup copies of the data associated with the service. The distributed control manager may store the first backup copy in the services shared data volume repository for availability purposes, and may store the second backup copy in persistent storage associated with the data manager for data protection purposes. The backup copies may be used during the update and/or to restore an updated service that is not performing as expected to its previous state prior to the update. The backup of the portion of the services shared data volume repository associated with the service may be generated via other and/or additional methods without departing from the invention.

In step 324, an update is applied to a standby service instance associated with the service.

In one or more embodiments of the invention, the distributed control manager applies the update to the standby service instance associated with the service. As discussed above, each service is associated with at least one active service instance and at least one standby service instance. The active service instance may be performing requests while the standby service may not be performing requests. The distributed control manager may initiate the instantiation of the updated standby service instance using at least a portion of computer instructions included in the update request. As a result, the standby service instance may be updated. Following the update of the standby service instance, the distributed control manager may switch the active and standby status of the updated standby service instance and the active service instance in the service routing table. Accordingly, the updated standby service may be switched to an updated active service and may begin to service requests. The distributed control manager may monitor the time it takes to update the standby service instance and store that information in the requests and performance metrics information repository. The update may be applied to the standby service instance associated with the service via other and/or additional methods without departing from the invention.

In one or more embodiments of the invention, the update may be applied by the distributed control manager to each service in the service sub-tree via the methods discussed above in steps 320, 322, and 324 prior to proceeding to step 326.

In step 326, a determination is made as to whether a performance and reliability check is above a threshold.

In one or more embodiments of the invention, the distributed control manager monitors the performance of requests of the updated active service instance. The monitoring may include obtaining requests and performance metrics information associated with the updated active service instance. The monitoring of the updated active service instance may be performed for a configurable amount of time and/or requests until the performance and reliability check is performed without departing from the invention. The performance and reliability check may include comparing requests and performance metrics information following the update of the updated active service with the requests and performance metrics information of the active service instance associated with the service prior to the update.

If the comparison made during the performance and reliability check indicates that the performance of the updated active service instance is above a configurable error threshold, then the distributed control manager may determine that the performance and reliability check is above a threshold. If the comparison made during the performance and reliability check indicates that the performance of the updated active service instance is not above a configurable error threshold, then the distributed control manager may determine that the performance and reliability check is not above a threshold. The determination as to whether a performance and reliability check is above a threshold may be made via other and/or additional methods without departing from the invention.

In one or more embodiments of the invention, if it is determined that the performance and reliability check is above a threshold, then the method proceeds to step 334. In one or more embodiments of the invention, if it is determined that the performance and reliability check is not above a threshold, then the method proceeds to step 328.

In one or more embodiments of the invention, the distributed control manager may determine whether a performance and reliability check is above a threshold for all of the updated services in the service sub-tree via the methods discussed above in step 326 prior to proceeding to steps 328 or 334. If it is determined that a performance and reliability check associated with one of the services of the service sub-tree is above a threshold, then the method may proceed to step 334. If it is determined that no performance and reliability check associated with any of the services of the service sub-tree are above a threshold, then the method may proceed to step 328.

In step 328, the update is applied to a previously active service instance associated with the service.

In one or more embodiments of the invention, the distributed control manager applies the update to the standby service instance (i.e., which was previously the active service instance) associated with the service. The distributed control manager may initiate the instantiation of the updated standby service instance using at least a portion of computer instructions included in the update request. As a result, the standby service instance may be updated. The distributed control manager may monitor the time it takes to update the previously active service instance and store that information in the requests and performance metrics information repository. The update may be applied to the standby service instance (i.e., which was previously the active service instance) associated with the service via other and/or additional methods without departing from the invention.

In one or more embodiments of the invention, the update may be applied to all previously active service instances associated with all services in the service sub-tree via the methods discussed above in step 328 prior to proceeding to step 330.

In step 330, a determination is made as to whether there is an additional service in the service sub-tree.

In one or more embodiments of the invention, the distributed control manager uses the update sequence to determine whether there is an additional service in the service sub-tree. The update sequence may include a list of service identifiers associated with the services included in each service sub-tree. As discussed above, the distributed control manager may tag the update sequence and/or may remove the service identifiers associated with previously selected services of the service sub-tree to indicate which services were previously selected. If the distributed control manager identifies an identifier associated with a service of the service sub-tree included in the update sequence that is not associated with a tag, then the distributed control manager may determine that there is an additional service in the service sub-tree. If the distributed control manager does not identify an identifier associated with a service of the service sub-tree included in the update sequence that is also not associated with a tag, then the distributed control manager may determine that there is not an additional service in the service sub-tree. The determination as to whether there is an additional service in the service sub-tree may be made via other and/or additional methods without departing from the invention.

In one or more embodiments of the invention, if it is determined that there is an additional service in the service sub-tree, then the method proceeds to step 320. In one or more embodiments of the invention, if it is determined that there is not an additional service in the service sub-tree, then the method proceeds to step 332.

In step 332, a determination is made as to whether there is an additional service sub-tree.

In one or more embodiments of the invention, the distributed control manager uses the update sequence to determine whether there is an additional service sub-tree associated with the service update event. The update sequence may include a list of service sub-tree identifiers associated with each service sub-tree. As discussed above, the distributed control manager may tag the update sequence and/or may remove the service sub-tree identifiers associated with previously selected service sub-trees to indicate which service sub-trees were previously selected. If the distributed control manager identifies an identifier associated with a service sub-tree included in the update sequence that is not associated with a tag, then the distributed control manager may determine that there is an additional service sub-tree. If the distributed control manager does not identify an identifier associated with a service sub-tree included in the update sequence that is also not associated with a tag, then the distributed control manager may determine that there is not an additional service sub-tree. The determination as to whether there is an additional service in the service sub-tree may be made via other and/or additional methods without departing from the invention.

In one or more embodiments of the invention, if it is determined that there is an additional service sub-tree, then the method proceeds to step 318. In one or more embodiments of the invention, if it is determined that there is not an additional service sub-tree, then the method ends following step 332.

In step 334, the update for the updated active service instance is reversed.

In one or more embodiments of the invention, the distributed control manager reverses the update to the updated active service instance using the backup of the service generated prior to updating the active service instance. The distributed control manager may switch the active and standby status of the updated active service instance and the standby service instance. As a result, the updated active service instance may be switched to the updated standby service instance and the standby service, which is has not been updated, may be switched to the active service instance. Accordingly, the active service instance may begin servicing requests. The distributed control manager may obtain one of the two backup copies associated with the service and use the backup copy to initiate the restoration of the updated standby service instance to instantiate the standby service instance to the state of the standby service instance prior to the update.

In one or more embodiments of the invention, following step 334, the method may proceed to step 330. In one or more embodiments of the invention, the update for all updated active service instances of the service sub-tree may be reversed via the methods discussed above in step 334 prior to proceeding to step 330. The distributed control manager may reverse the updates of all services in the service sub-tree to maintain compatibility between the services in the service sub-tree.

FIG. 3D shows a flowchart of a method for predicting an update window in accordance with one or more embodiments of the invention. The method may be performed by, for example, a distributed control manager (104) of a data manager (100). Other components of the system illustrated in FIG. 1A may perform all, or a portion, of the method of FIG. 3D without departing from the invention.

While FIG. 3D is illustrated as a series of steps, any of the steps may be omitted, performed in a different order, additional steps may be included, and/or any or all of the steps may be performed in a parallel and/or partially overlapping manner without departing from the invention.

In step 340, the service sub-tree update completion time is estimated.

In one or more embodiments of the invention, the distributed control manager uses a random forest regression algorithm to generate an estimation of the update completion time for the service sub-tree. The distributed control manager may obtain from the requests and performance metrics information repository the actual update completion times for previous updates associated with each service in the service sub-tree. This update completion time may be an average update completion time calculated over multiple past updates associated with each service. The distributed control manager may then calculate the overall update completion times of the service sub-tree based on the previous updated completion times of each service. The distributed control manager may then apply a random forest regression model to the overall update completion times to generate an estimation of the update completion time. The distributed control manager may apply any type of prediction model capable of generating such predictions without departing from the invention.

Furthermore, for sets of independent services having the same rank, the distributed control manager may select the maximum update completion time among these services as a same rank independent service update completion time. For example, assume that a set of independent services having the same rank includes three independent services. The update completion times of the three independent services are 3 minutes, 5 minutes, and 2 minutes, respectively. The distributed control manager selects the maximum update completion time of 5 minutes and sets this time as the same rank independent service update completion time for this set of three independent services. In other words, it will take a maximum of 5 minutes to update these three independent services in parallel.

The distributed control manager may add a configurable buffer percentage of time to the estimated update completion time to obtain the final estimated updated completion time. The configurable buffer percentage of time may be a percentage of the estimated update completion time output by the random forest regression model. The configurable buffer percentage of time may be added to ensure enough time is included in the estimation to perform performance and reliability checks associated with the updated services of the service sub-tree. Additionally, the configurable buffer percentage time may be added to ensure estimated update window in not a period of time that is shorter than the actual update window. The service sub-tree update completion time may be estimated via other and/or additional methods without departing from the invention. A non-limiting example showing details of an update completion estimation process is discussed below in FIGS. 5A-5D.

In step 342, the future requests for services associated with the service sub-tree are predicted to obtain a future request density transition set.

In one or more embodiments of the invention, the distributed control manager uses the requests and performance metrics information associated with requests serviced by the services of the service sub-tree included in the requests and performance metrics information repository to obtain the future requests transition set. The distributed control manager may use the requests and performance metrics information to generate time series data. The time series data may include requests and performance metrics information that are associated with points in time. The distributed control manager may classify the time series data based on request types (e.g., read requests, write requests) and where the requests originated from (i.e., internal requests from other services of the data manager or external requests from other entities such as the clients) to determine which request may be allowed and/or restricted during the performance of the update. In addition to the requests and performance metrics information associated with past requests serviced by the services of the service sub-tree, the times series data may also include the utilization information included in the requests and performance metrics information repository associated with hardware components of the data manager.

The distributed control manager may apply the time series data to a probabilistic weighted fuzzy times series model to obtain the prediction of the future request density transition set for each service in the service sub-tree. The distributed control manager may apply any other prediction model capable of generating predictions of the number of future requests for each service without departing from the invention. The future requests transition set may include predictions for the number of requests sent to each service at future points in time. The future requests transition set may also include predictions of future utilization information at future points in time. The future requests transitions set may be associated with a configurable number of future points in time. The future requests for services associated with the service sub-tree may be predicted to obtain a future request density transition set via other and/or additional methods without departing from the invention.

In step 344, peak smoothing is performed on the future requests transition set.

In one or more embodiments of the invention, the distributed control manager may perform peak smoothing on the future requests transition set to obtain a smoothed updated future requests transition set. The future requests transitions sets may include points in time associated with a number of requests and/or utilization information that are significantly higher than that of the previous point in time and the subsequent point in time. The distributed control manager may identify these points in time as peaks. If the peaks (i.e., the number of requests and/or utilization information) are above a configurable percentage of the neighboring points in time, the distributed control manager may remove the peaks from the future requests transition set to smooth the future requests transition set and to stabilize the future requests transition set. Peak smoothing may be performed on the future requests transition set via other and/or additional methods without departing from the invention.

In step 346, continuous accuracy improvement is performed on the future request density transition set to obtain an updated future request density transition set.

In one or more embodiments of the invention, the distributed control manager performs continuous accuracy improvement on the future request density transition set using the real time monitoring updates of the requests and performance metrics information repository. The distributed control manager may compare the future request density transition set to the number of requests services for the services of the service sub-tree included in the requests and performance metrics information repository for a portion of the future points in time included in the future requests transition set as they occur in real time. If the predicted values and the real monitored values are different by a configurable percentage, the distributed control manager may update the future requests transition set. Continuous accuracy improvement may be performed on the future request density transition set to obtain an updated future request density transition set via other and/or additional methods without departing from the invention.

In step 348, dynamic update window identification markings (DUWIMs) for the service sub-tree are identified.

In one or more embodiments of the invention, the distributed control manager uses the updated future request density transition set to identify DUWIMs for the service sub-tree. The distributed control manager may divide the future requests transition set into periods of time spanning the entirety of the future requests transition set. The distributed control manager may divide the future requests set into any number of periods of time of any length in time without departing from the invention. For each period of time, the distributed control manager may determine whether the request density for each service is associated with a high usage, a medium usage, and/or a low usage. The request density may refer to the number of requests per service of the service subtree. Low usage may refer to a request density between zero and ten percent, medium usage may refer to a request density between ten and fifty percent, and high usage may refer to a request density between fifty and one hundred percent.

The distributed control manager may use a different level of granularity of levels of use and divisions of requests density associated with each level of use without departing from the invention. The distributed control manager may assign a DUWIM of 1 to all time periods associated with a low usage, and may assign a DUWIM of 0 to all time periods associated with a medium or high usage. The distributed control manager may update the DUWIMs based on the continuous accuracy improvements made over time in step 346. The DUWIMs may be identified for the service sub-tree via other and/or additional methods without departing from the invention.

In step 350, the update window is identified using the DUWIMs.

In one or more embodiments of the invention, the distributed control manager uses the DUWIMs and the estimated service sub-tree completion time to identify the update window. The distributed control manager may identify consecutive periods of time associated with DUWIMs of 1 that coincide with a greater or equal amount of time than the estimated service sub-tree completion time as the update window. The update window may be identified using the DUWIMs via other and/or additional methods without departing from the invention.

The method may end following step 350.

To further clarify embodiments of the invention, non-limiting examples are provided in FIGS. 4A-5D. Turning to FIGS. 4A-4E, FIGS. 4A-4E show diagrams of operations of an example system over time. FIGS. 4A-4E may show a system similar to that illustrated in FIG. 1A. Actions performed by components of the system are illustrated by numbered, circular boxes interconnected with arrowed lines. For the sake of brevity, only a limited number of components illustrated in FIG. 1A are illustrated in FIGS. 4A-4E.

Example

Turning to FIG. 4A, consider a scenario in which service A (110A) registers with a discovery manager (102) of a data manager (100). At step 1, service A (110A) sends a discovery request to the discovery manager (102). The discovery manager (102) identifies obtaining the registration request as a service change event. In response to obtaining the registration request, at step 2, the discovery manager (102) makes a determination that the service change event is associated with a new service. Next, at step 3, the discovery manager (102) obtains service metadata associated with service A (110A). The service metadata specifies that service A (110A) includes a service A active instance (112A) and a service A standby instance (114A). The service metadata includes other information regarding service A (110A) such as, for example, access information including and IP address and a port number that may be used to access service A (110A). After obtaining the service metadata associated with service A (110A) the discovery manager updates a service routing table in the storage (120) to include the service metadata associated with service A (110A).

Turning to FIG. 4B, at some point in time after updating the service routing table, at step 5, a distributed control manager (104) of the data manager (100) identifies an update event. In response to identifying the update event, at step 6, the distributed control manager (104) obtains a service call graph from the storage (120). At step 7, the distributed control manager (104) identifies a service sub-tree associated with the update event using the service call graph. The service sub-tree includes two services of data manager (100), service A (110A) and service N (110N). At step 8, the distributed control manager (104) generates an update sequence for the service sub-tree using the service call graph. The update sequence specifies that service A (110A) is to be updated first and service N (110N) is to be updated second.

At step 9, the distributed control manager (104) predicts the update window for the service sub-tree. The update window specifies a period of time in which service A (110A) and service N (110N) receive a minimal amount of requests to perform. When the update window begins, at step 10, the distributed control manager (104) selects the service sub-tree. At step 11, the distributed control manager (104) selects service A (110A) of the service sub-tree. At step 12, the distributed control manager (104) backs up the data associated with service A (110A) in the services shared data volume of the storage (120). At step 13, the distributed control manager (104) applies the update to the service A standby instance (114A) and then switches the service A standby instance (114A) to an active instance and the service A active instance (112A) to a standby instance.

Turning to FIG. 4C, at step 14, the service A standby instance (114A), which is now an active instance and is updated, performs requests for a period of time. At step 15, the distributed control manager (104) obtains requests and performance metrics information associated with the aforementioned performance of the requests. At step 16, the distributed control manager (104) performs a performance and reliability check using the obtained requests and performance metrics information and determines that the service A standby instance (114A), which is now an active instance and is updated, is performing at an optimal level. Based on the determination, at step 17, the distributed control manager (104) finishes the update of service A (110A) by updating the service A active instance (112A), which is now a standby instance.

Turning to FIG. 4D, at step 18, the distributed control manager (104) selects service N (110N) of the service sub-tree. At step 19, the distributed control manager (104) backs up the data associated with service N (110N) in the services shared data volume of the storage (120). At step 20, the distributed control manager (104) applies the update to the service N standby instance (114N) and then switches the service N standby instance (114N) to an active instance and the service N active instance (112N) to a standby instance. At step 21, the service N standby instance (114N), which is now an active instance and is updated, performs requests for a period of time. At step 22, the distributed control manager (104) obtains requests and performance metrics information associated with the aforementioned performance of the requests.

Turning to FIG. 4E, at step 23, the distributed control manager (104) performs a performance and reliability check using the obtained requests and performance metrics information and determines that the service N standby instance (114N), which is now an active instance and is updated, is not performing at an optimal level. Based on the determination, at step 24, the distributed control manager (104) switches the service N active instance (112N) back to an active instance and the switches service N standby instance (114N), which is now updated, back to a standby instance. Furthermore, the distributed control manager reverts the service N standby instance (114N) back to its original version. At step 25, the distributed control manager (104) determines there are no more services included in the service sub-tree.

End of Example

To further clarify embodiments of the invention, a non-limiting example is provided in FIGS. 5A-5D. FIGS. 5A-5D show a non-limiting example illustrating how an update window is determined from an example service call graph.

Start of Example

Starting with FIG. 5A, FIG. 5A shows a service call graph (500). The service call graph (500) includes a plurality of services (502) (i.e., services R, A, B, C, D, E, F, G, H, and Z). The service call graph (500) also shows dependencies (504) between each of the services (502). This service call graph (500) is divided into five (5) hierarchical levels with service R (502) as the lowest level with the lowest rank. In this example, rank 1 is the highest rank while level 4 is the highest level. The hierarchical levels of the service call graph (500) are as follows:

Level 0 (rank 5)—Service R Level 1 (rank 4)—Service A, Service B Level 2 (rank 3)—Services C, Service D, Service E Level 3 (rank 2)—Service F, Service G, Service H Level 4 (rank 1)—Service Z

Service sub-trees of the service call graph (500) are now identified. In particular, the service call graph (500) is first divided into smaller, individual service call graphs with a lowest-ranked service (i.e., service R) as a common starting service. This first split of the service call graph (500) is shown in FIG. 5B. The following dependencies (starting from top left to bottom right) are identified for each split service call graph:

1. R:A:C:F:Z 2. R:A:C:G 3. R:A:D:H:Z 4. R:B:D:H:Z 5. R:B:Z 6. R:B:E

As shown in the above dependencies, one or more of the split service call graphs shown in FIG. 5B still share similar dependencies (e.g., dependencies R:A:C, R:A, and R:B). As a result, these split call service call graphs are further split into even smaller service call graphs as shown in FIG. 5C. The following dependencies (starting from top left to bottom right) are identified for each split service call graph in FIG. 5C:

1. R:A:C 2. C:F:Z 3. C:G 4. R:A:D 5. D:H:Z 6. R:B:D 7. R:B 8. B:Z 9. B:E

As shown in the above dependencies, one or more of the split service call graphs shown in FIG. 5C still share similar dependencies (e.g., dependencies R:A and R:B). As a result, these split service call graphs still sharing similar dependencies are further split into even smaller service call graphs as shown in FIG. 5D. The following dependencies (starting from top left to bottom right) are identified for each split service call graph in FIG. 5D:

1. R:A 2. A:C 3. C:F:Z 4. C:G 5. A:D 6. D:H:Z 7. R:B 8. B:D 9. B:Z 10. B:E

As shown in the above dependencies, none of the split service call graphs shown in FIG. 5D share a similar dependency. Each of these further split service call graphs of FIG. 5D are identified as service sub-trees (506) of the service call graph (500) shown in FIG. 5A. Once these service sub-trees (506) are identified, each of these service sub-trees (506) in FIG. 5D are assigned a rank based on the ranks of the services in each service sub-tree. The resulting ranking is shown below in Table 1.

TABLE 1 Service Sub-Trees with Ranking of each Service Sub-Tree Service Sub-Tree Level in Service Call Graph Ranking R:A Level 0:Level 1 4 A:C Level 1:Level 2 3 C:F:Z Level 2:Level 3:Level 4 2 C:G Level 2:Level 3 2 A:D Level 1:Level 2 3 D:H:Z Level 2:Level 3:Level 4 2 R:B Level 0:Level 1 4 B:D Level 1:Level 2 3 B:Z Level 1:Level 4 1 B:E Level 1:Level 2 3 R Level 0 5

Based on the ranking of each service sub-tree and the ranking of the services in each service sub-tree, an update sequence for the services is generated as shown in below Table 2. As shown in Table 2, in this non-limiting example, the sequence is determined by updating the services starting from a highest level (i.e., level 4) of the service call graph (500) towards a lowest level (i.e., level 0) and from left to right in each level of the service call graph (500).

TABLE 2 Update Sequence for Service Call Graph (500) Sequence Service 1 Z 2 F 3 H 4 G 5 C 6 D 7 E 8 A 9 B 10 R

The above sequence in Table 2 does not take into consideration of the independent services within the service call graph (500) of FIG. 5A. Turning back to FIG. 5A, the independent services among the services (502) of the service call graph (500) are identified. In particular, as shown in FIG. 5A, service A and service B are at the same level (i.e., have the same rank). However, service A and service B share a common immediate parent service R (i.e., service R directly depends from both service A and service B. As a result, service A and service B are not identified as independent services.

In contrast, service C, service D, and service D are also at the same level. Service C and service D share a common immediate parent service A. Therefore, service C and service D cannot be a set of independent services. Similarly, service D and service D also cannot be a set of independent services because these two services share a common immediate parent service B. However, service C and service E do not share a common immediate parent. As a result, service C and service E are identified as a set of independent services able to be updated in parallel without affecting an update of any immediate lower level services (i.e., service A and service B). Similarly, at the next level (i.e., the level with service F, service G, and service H), service F and service H are identified as a set of independent services while service G and service H are identified as another set of independent services.

As a result of the above identification, the update sequence in Table 2 is updated to take into consideration all of the sets of independent services and a new update sequence is generated in below Table 3. As shown in below Table 3, the set of independent services with service F and service H is selected instead of the set with service H and service G. This is because, as discussed above, the update sequence starts from left to right at each level. In the event the update sequence is reversed to start from right to left, the set of independent services with service H and service G may be selected instead of the set with service F and service H (although in this reverse scenario either set has the same possibility of being selected as long as the update at this level starts with service H).

TABLE 3 Update Sequence Considering Independent Services Sequence Services 1 Z 2 F H 3 G 4 C E 5 D 6 A 7 B 8 R

The average update completion time of each service is then retrieved to determine an overall update completion time for the services in the service call graph (500) of FIG. 5A. The resulting overall update completion time is shown in below Table 4. As shown in Table 4, a maximum update completion time is selected as the update completion time of the sets of independent services. As shown in below Table 4, service F and service H have a same rank independent service update completion time of 8:45 while service C and service E have a same rank independent service update completion time of 4:30.

TABLE 4 Overall Update Completion Time for Service Call Graph (500) Final Update Average Update Completion Time Sequence Services Completion Time per Level 1 Z 5:30 5:30 2 F H Max (8:45, 4:30) = 8:45 Sum (8:45, 6:40) = 15:25 3 G 6:40 4 C E Max (3:30, 4:30) = 4:30 Sum (4:30, 5:30) = 10:00 5 D 5:30 6 A 4:45 Sum (4:45, 7:30) = 11:75 7 B 7:30 8 R 3:30 3:30 Sum 46:40  Random forest regression applied SumT Configurable buffer X added SumT + X Overall update completion time SumT + X

End of Example

As discussed above, embodiments of the invention may be implemented using computing devices. FIG. 6 shows a diagram of a computing device in accordance with one or more embodiments of the invention. The computing device (600) may include one or more computer processors (602), non-persistent storage (604) (e.g., volatile memory, such as random access memory (RAM), cache memory), persistent storage (606) (e.g., a hard disk, an optical drive such as a compact disk (CD) drive or digital versatile disk (DVD) drive, a flash memory, etc.), a communication interface (612) (e.g., Bluetooth interface, infrared interface, network interface, optical interface, etc.), input devices (610), output devices (608), and numerous other elements (not shown) and functionalities. Each of these components is described below.

In one embodiment of the invention, the computer processor(s) (602) may be an integrated circuit for processing instructions. For example, the computer processor(s) may be one or more cores or micro-cores of a processor. The computing device (600) may also include one or more input devices (610), such as a touchscreen, keyboard, mouse, microphone, touchpad, electronic pen, or any other type of input device. Further, the communication interface (612) may include an integrated circuit for connecting the computing device (600) to a network (not shown) (e.g., a local area network (LAN), a wide area network (WAN) such as the Internet, mobile network, or any other type of network) and/or to another device, such as another computing device.

In one embodiment of the invention, the computing device (600) may include one or more output devices (608), such as a screen (e.g., a liquid crystal display (LCD), a plasma display, touchscreen, cathode ray tube (CRT) monitor, projector, or other display device), a printer, external storage, or any other output device. One or more of the output devices may be the same or different from the input device(s). The input and output device(s) may be locally or remotely connected to the computer processor(s) (602), non-persistent storage (604), and persistent storage (606). Many different types of computing devices exist, and the aforementioned input and output device(s) may take other forms.

One or more embodiments of the invention may be implemented using instructions executed by one or more processors of the data management device. Further, such instructions may correspond to computer readable instructions that are stored on one or more non-transitory computer readable mediums.

One or more embodiments of the invention may improve the performance of updates for a data manager. More specifically, embodiments of the invention relate to updating services in a manner that minimizes the downtime of the data manager. In traditional systems, the a data manager may have to go offline in order to perform an update, which may result in a period of unavailability thereby resulting in a delay in the performance of critical management services by the data manager. Embodiments of the invention improve the efficiency of updating a data manager. As discussed above, embodiments of the invention relate to updating the services of the data manager in a way such that the data manager remains available during the update to perform the critical management services.

Additionally, embodiments of the invention improve an overall updating sequence and overall updating time (i.e., duration) of the services. In particular, two or more services that can be updated at the same time without affecting other services in the service call graph are identified and updated in parallel. Consequently, all services within the service call graph can be updated using the least necessary time and computing resources, which directly improves the computing functionalities (e.g., improvement of computing resource use and allocation) of a computing device updating the services.

Thus, embodiments of the invention may address the problem of inefficient use of computing resources to perform updates of a data manager in a system. This problem arises due to the technological nature of the environment in which the data manager operates.

The problems discussed above should be understood as being examples of problems solved by embodiments of the invention disclosed herein and the invention should not be limited to solving the same/similar problems. The disclosed invention is broadly applicable to address a range of problems beyond those discussed herein.

While the invention has been described with respect to a limited number of embodiments, those skilled in the art, having benefit of this disclosure, will appreciate that other embodiments can be devised which do not depart from the scope of the technology as disclosed herein. Accordingly, the scope of the invention should be limited only by the attached claims. 

1. A method for managing updates of a data manager, the method comprising: obtaining a service call graph, wherein the service call graph comprises services grouped into service sub-trees and specifies a service hierarchy between the services; identifying the service sub-trees of the service call graph; identifying, using the service hierarchy, independent services among the services of the service call graph; generating, based on identifying the service sub-trees and the independent services, an update sequence for the services; predicting, using the update sequence and the services, an update window for the service sub-trees, wherein predicting the update window for the service sub-trees comprises: obtaining an update completion time of each of the services of the service call graph, wherein all of the services aside from the independent services are dependent services; predicting future requests for services associated with a service sub-tree among the service sub-trees to obtain a future request density transition set; and identifying the update window using dynamic update window identification markings (DUWIMs); initiating an update of the services using the prediction of the update window; and providing the updated services to a client.
 2. The method of claim 1, wherein each of the service sub-trees comprises services sharing a unique dependency not included in other ones of the service sub-trees.
 3. The method of claim 2, wherein the method further comprises: specifying, based on the service hierarchy, a rank for each of the service sub-trees and each of the services making up the service call graph, wherein the update sequence is generated using the rank, and wherein the rank of a service sub-tree among the service sub-trees is based on a position of the service sub-tree in the service hierarchy.
 4. The method of claim 3, wherein identifying the independent services comprises: identifying at least two services among the services having a same rank; initiating a first determination that no services among the services depend directly from both of the at least two services having the same rank; and initiating a second determination, based on the first determination, that the at least two services having the same rank are the independent services.
 5. The method of claim 4, wherein the independent services having the same rank are updated in parallel.
 6. The method of claim 4, wherein the update sequence specifies an order in which the services of the service call graph are to be updated, and the update sequence starts from a service among the services without a dependency to other ones of the services.
 7. The method of claim 6, wherein predicting the update window for the service sub-trees further comprises: independent service update completion time, a maximum update completion time from among the update completion times of the independent services having the same rank; and initiating generation of a total update completion time for the update window using the same level independent service update completion time and the update completion times of each of the dependent services.
 8. The method of claim 7, wherein predicting the update window for the service sub-trees further comprises: performing peak smoothing on the future request density transition set; performing continuous accuracy improvement to obtain an updated future request density transition set; and identifying the DUWIMs for the service sub-tree based on the updated future request density transition set.
 9. The method of claim 1, wherein the update completion time of each of the services of the service call graph is an average update completion time calculated using previous updates of each of the services.
 10. The method of claim 9, wherein the average update completion time is based on one or more time series data.
 11. A non-transitory computer readable medium (CRM) comprising computer readable program code, which when executed by a computer processor enables the computer processor to perform a method for managing updates of a data manager, the method comprising: obtaining a service call graph, wherein the service call graph comprises services grouped into service sub-trees and specifies a service hierarchy between the services; identifying the service sub-trees of the service call graph; identifying, using the service hierarchy, independent services among the services of the service call graph; generating, based on identifying the service sub-trees and the independent services, an update sequence for the services; predicting, using the update sequence and the services, an update window for the service sub-trees, wherein predicting the update window for the service sub-trees comprises: obtaining an update completion time of each of the services of the service call graph, wherein all of the services aside from the independent services are dependent services; predicting future requests for services associated with a service sub-tree among the service sub-trees to obtain a future request density transition set; and identifying the update window using dynamic update window identification markings (DUWIMs); initiating an update of the services using the prediction of the update window; and providing the updated services to a client.
 12. The CRM of claim 11, wherein each of the service sub-trees comprises services sharing a unique dependency not included in other ones of the service sub-trees.
 13. The CRM of claim 12, wherein the method further comprises: specifying, based on the service hierarchy, a rank for each of the service sub-trees and each of the services making up the service call graph, wherein the update sequence is generated using the rank, and wherein the rank of a service sub-tree among the service sub-trees is based on a position of the service sub-tree in the service hierarchy.
 14. The CRM of claim 13, wherein identifying the independent services comprises: identifying at least two services among the services having a same rank; initiating a first determination that no services among the services depend directly from both of the at least two services having the same rank; and initiating a second determination, based on the first determination, that the at least two services having the same rank are the independent services.
 15. The CRM of claim 14, wherein the independent services having the same rank are updated in parallel.
 16. A system for managing updates of a data manager, the system comprising: a data manager comprising services; a distributed control manager of the data manager, comprising a processor and memory, configured to: obtain a service call graph, wherein the service call graph comprises the services grouped into service sub-trees and specifies a service hierarchy between the services; identify the service sub-trees of the service call graph; identify, using the service hierarchy, independent services among the services of the service call graph; generate, based on identifying the service sub-trees and the independent services, an update sequence for the services; predict, using the update sequence and the services, an update window for the service sub-trees, wherein predicting the update window for the service sub-trees comprises: obtaining an update completion time of each of the services of the service call graph, wherein all of the services aside from the independent services are dependent services; predicting future requests for services associated with a service sub-tree among the service sub-trees to obtain a future request density transition set; and identifying the update window using dynamic update window identification markings (DUWIMs); initiate an update of the services using the prediction of the update window; and providing the updated services to a client.
 17. The system of claim 16, wherein each of the service sub-trees comprises services sharing a unique dependency not included in other ones of the service sub-trees.
 18. The system of claim 17, wherein distributed control manager of the data manager is further configured to: specify, based on the service hierarchy, a rank for each of the service sub-trees and each of the services making up the service call graph, wherein the update sequence is generated using the rank, and wherein the rank of a service sub-tree among the service sub-trees is based on a position of the service sub-tree in the service hierarchy.
 19. The system of claim 18, wherein identifying the independent services comprises: identifying at least two services among the services having a same rank; initiating a first determination that no services among the services depend directly from both of the at least two services having the same rank; and initiating a second determination, based on the first determination, that the at least two services having the same rank are the independent services.
 20. The system of claim 19, wherein the independent services having the same rank are updated in parallel. 